Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions
نویسندگان
چکیده
منابع مشابه
Dynamic Min-Max Problems
A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. 20 2. G t is a dominating subgraph of G c as there are no edges between nodes v i 2 V ? t and v j 2 (V + nV + t), G t has a min-max potential and G c has a min potential. G t is a maximal dominating subgraph of G c. To proof this, let us suppose that a subgraph G q of G c nG t cou...
متن کاملMin-max-min Geometric Facility Location Problems
We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...
متن کاملMax-min fair allocation of indivisible goods
We consider the problem of fairly allocating a set of m indivisible goods to n agents, given the agents' utilities for each good. Fair allocations in this context are those maximizing the minimum utility received by any agent. We give hardness results and polynomial time approximation algorithms for several variants of this problem. Our main result is a bicriteria approximation in the model wit...
متن کاملMin-Max quickest path problems
In a dynamic network, the quickest path problem asks for a path such that a given amount of flow can be sent from source to sink via this path in minimal time. In practical settings, for example, in evacuation or transportation planning, the problem parameters might not be known exactly a priori. It is therefore of interest to consider robust versions of these problems in which travel times and...
متن کاملMax - Min Eigenvalue Problems , Primal -
Two Primal-dual interior point algorithms are presented for the problem of maximizing the smallest eigenvalue of a symmetric matrix over diagonal perturbations. These algorithms prove to be simple, robust, and eecient. Both algorithms are based on transforming the problem to one over the cone of positive semideenite matrices. One of the algorithms does this transformation through an intermediat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1981
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.29.1.207